Covering techniques in Auslander–Reiten theory
نویسندگان
چکیده
منابع مشابه
using game theory techniques in self-organizing maps training
شبکه خود سازمانده پرکاربردترین شبکه عصبی برای انجام خوشه بندی و کوانتیزه نمودن برداری است. از زمان معرفی این شبکه تاکنون، از این روش در مسائل مختلف در حوزه های گوناگون استفاده و توسعه ها و بهبودهای متعددی برای آن ارائه شده است. شبکه خودسازمانده از تعدادی سلول برای تخمین تابع توزیع الگوهای ورودی در فضای چندبعدی استفاده می کند. احتمال وجود سلول مرده مشکلی اساسی در الگوریتم شبکه خودسازمانده به حسا...
Theory of Covering Spaces
Introduction. In this paper I study covering spaces in which the base space is an arbitrary topological space. No use is made of arcs and no assumptions of a global or local nature are required. In consequence, the fundamental group ir(X, Xo) which we obtain frequently reflects local properties which are missed by the usual arcwise group iri(X, Xo). We obtain a perfect Galois theory of covering...
متن کاملCovering Spaces in Homotopy Type Theory∗
Broadly speaking, algebraic topology consists of associating algebraic structures to topological spaces that give information about their structure. An elementary, but fundamental, example is provided by the theory of covering spaces, which associate groups to covering spaces in such a way that the universal cover corresponds to the fundamental group of the space. One natural question to ask is...
متن کاملThe covering number in learning theory
Learning Theory studies learning objects from random samples. The main question is: How many samples do we need to ensure an error bound with certain con ̄dence? To answer this question, the covering numbers or entropy numbers play an essential role, as shown by Vapnik, Poggio, CuckerSmale, and many others. For kernel machine learning such as the Support Vector Machine, a Reproducing Kernel Hilb...
متن کاملCovering Pareto Sets by Multilevel Subdivision Techniques
In this work we present a new set oriented numerical method for the numerical solution of multi-objective optimization problems. These methods are global in nature and allow to approximate the entire set of (global) Pareto points. After proving convergence of an associated abstract subdivision procedure we use this result as a basis for the development of three different algorithms. We also con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2019
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2018.04.013